Inversion of circulant matrices over $\mathbf{Z}_m$
نویسندگان
چکیده
منابع مشابه
Inversion of Circulant Matrices over Zm
In this paper we consider the problem of inverting an n × n circulant matrix with entries over Zm. We show that the algorithm for inverting circulants, based on the reduction to diagonal form by means of FFT, has some drawbacks when working over Zm. We present three different algorithms which do not use this approach. Our algorithms require different degrees of knowledge of m and n, and their c...
متن کاملThe ElGamal cryptosystem over circulant matrices
In this paper we study extensively the discrete logarithm problem in the group of non-singular circulant matrices. The emphasis of this study was to find the exact parameters for the group of circulant matrices for a secure implementation. We tabulate these parameters. We also compare the discrete logarithm problem in the group of circulant matrices with the discrete logarithm problem in finite...
متن کاملInversion of Matrices over a Commutative Semiring
It is a well-known consequence of the elementary theory of vector spaces that if A and B are n-by-n matrices over a field (or even a skew field) such that AB = 1, then BA = 1. This result remains true for matrices over a commutative ring, however, it is not, in general, true for matrices over noncommutatives rings. In this paper we show that if A and B are n-by-n matrices over a commutative sem...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملApplication of Circulant Matrices
A k x k matrix A = [aU lover a field F is called circulant if aij = a (j-i) mod k' A [2k ,k l linear code over F = GF (q) is called double-circulant if it is generated by a matrix of the fonn [I A l, where A is a circulant matrix. In this work we ftrst employ the Fourier transform techJ nique to analyze and construct se:veral families of double-circulant codes. The minimum distance of the resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2000
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-00-01235-7